Combinatorial identities for binary necklaces from exact ray-splitting trace formulae
نویسنده
چکیده
Based on an exact trace formula for a one-dimensional ray-splitting system, we derive novel combinatorial identities for cyclic binary sequences (Pólya necklaces). 02.10.Eb, 02.30.Lt, 05.45.+b Typeset using REVTEX 1
منابع مشابه
0 10 70 26 v 1 2 6 Ju l 2 00 1 Combinatorial identities for binary necklaces from exact ray - splitting trace formulae
Based on an exact trace formula for a one-dimensional ray-splitting system, we derive novel combinatorial identities for cyclic binary sequences (Pólya necklaces).
متن کاملExact trace formulae for a class of one-dimensional ray-splitting systems
Based on quantum graph theory we establish that the ray-splitting trace formula proposed by Couchman et al. (Phys. Rev. A 46, 6193 (1992)) is exact for a class of one-dimensional ray-splitting systems. Important applications in combinatorics are suggested. PACS: 05.45.+b,03.65.Sq,72.15.Rn
متن کاملCOMBINATORIAL IDENTITIES DERIVING FROM THE n-th POWER OF A 2× 2 MATRIX
In this paper we give a new formula for the n-th power of a 2× 2 matrix. More precisely, we prove the following: Let A = ( a b c d ) be an arbitrary 2×2 matrix, T = a+ d its trace, D = ad− bc its determinant and define yn : = bn/2c ∑ i=0 ( n− i i ) T n−2i(−D)i. Then, for n ≥ 1, A = ( yn − d yn−1 b yn−1 c yn−1 yn − a yn−1 ) . We use this formula together with an existing formula for the n-th pow...
متن کاملSplitting Necklaces and a Generalization of the Borsuk-ulam Antipodal Theorem
We prove a very natural generalization of the Borsuk-Ulam antipodal Theorem and deduce from it, in a very straightforward way, the celebrated result of Alon [1] on splitting necklaces. Alon’s result says that t(k− 1) is an upper bound on the number of cutpoints of an opened t-coloured necklace so that the segments we get can be used to partition the set of vertices of the necklace into k subset...
متن کاملA combinatorial problem about binary necklaces and attractors of Boolean automata networks
It is known that there are no more Lyndon words of length n than there are periodic necklaces of same length. This paper considers a similar problem where, additionally, the necklaces must be without some forbidden factors. This problem relates to a different context, concerned with the behaviours of particular discrete dynamical systems, namely, Boolean automata networks. A formal argument sup...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007